Statistical Pruning for Near-Maximum Likelihood Decoding
نویسندگان
چکیده
منابع مشابه
Efficient Statistical Pruning for Maximum Likelihood Decoding Radhika
In many communications problems, maximum-likelihood (ML) decoding reduces to finding the closest (skewed) lattice point in N-dimensions to a given point x E CN. In its full generality, this problem is known to he NP-complete and requires exponential complexity in iV. Recently, the expected complexity of the sphere decoder, a particular algorithm that solves the ML problem exactly, has been comp...
متن کاملNear Maximum Likelihood Decoding with Deep Learning
A novel and efficient neural decoder algorithm is proposed. The proposed decoder is based on the neural Belief Propagation algorithm and the Automorphism Group. By combining neural belief propagation with permutations from the Automorphism Group we achieve near maximum likelihood performance for High Density Parity Check codes. Moreover, the proposed decoder significantly improves the decoding ...
متن کاملEllipsoidal lists and maximum-likelihood decoding
We study an interrelation between the coverings generated by linear ( )–codes and complexity of their maximum-likelihood (ML) decoding. First, discrete ellipsoids in the Hamming spaces are introduced. These ellipsoids represent the sets of most probable error patterns that need to be tested in soft-decision ML decoding. We show that long linear ( )-codes surrounded by ellipsoids of exponential ...
متن کاملFountain Codes under Maximum Likelihood Decoding
This dissertation focuses on fountain codes under maximum likelihood (ML) decoding. Fountain codes are a class of erasure correcting codes that can generate an endless amount of coded symbols and were conceived to deliver data files over data networks to a potentially large population of users. First Luby transform (LT) codes are considered, which represent the first class of practical fountain...
متن کاملConvolutional Codes II. Maximum-Likelihood Decoding
Find the secret to improve the quality of life by reading this convolutional codes ii maximum likelihood decoding. This is a kind of book that you need now. Besides, it can be your favorite book to read after having this book. Do you ask why? Well, this is a book that has different characteristic with others. You may not need to know who the author is, how well-known the work is. As wise word, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2007
ISSN: 1053-587X
DOI: 10.1109/tsp.2006.890912